Deleting tuples using separate transaction identifier storage

ABSTRACT

Data from a database object are processed. Transaction information for a set of data of the database object is stored separate from the set of data in an allocated storage space, where the transaction information indicates visibility of the set of data to other transactions. A map structure is generated indicating storage of the set of data and the allocated storage space of the transaction information. The transaction information is altered in response to a transaction to the set of data to alter visibility of the set of data. Altering the transaction information is accomplished by providing updated transaction information within a new storage space in accordance with the transaction to the set of data and generating a descriptor for the transaction indicating an existing location of the set of data and the new storage space.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 14/501,745, entitled “DELETING TUPLES USING SEPARATE TRANSACTION IDENTIFIER STORAGE” and filed Sep. 30, 2014, the disclosure of which is incorporated herein by reference in its entirety.

BACKGROUND

Present invention embodiments relate to deleting tuples in a database, and more specifically, to deleting tuples in a database column store when the database employs separate transaction identifier storage.

In a relational database, tables of data are stored in which data from one table may have some relationship with the data stored in another table. The relationships between the data in the various tables allow the processing of queries (e.g., database searches) in an orderly fashion.

When plural users or computer processes have access to the same database simultaneously (i.e., concurrently), issues may arise with respect to changing the existing data in the database. For example, if a database record is in the process of being created or modified, many database systems that do not provide concurrency control will “lock” that record for the duration of the update. Thus, in order to avoid the “locking” of individual or groups of records, multiple copies of the same record are permitted using multi-version concurrency control (MVCC) whereby multiple transactional changes to a database record are reconciled at some later point in time. However, when a database employs MVCC, multiple users or processes may change a record and multiple copies of the same record (with their corresponding changes) are stored until all changes are reconciled and committed.

Thus, in order to reconcile multiple changes to a given record, transaction identifiers (TIDs) are maintained for each copy or version of a record with actual or attempted record changes.

A version of a record is marked for removal, either due to deletion or update of the record, by modifying the TID associated with that record. The TIDs may be modified “in place”; the record is read, then modified, and stored anew, thereby undesirably increasing database input/output (I/O) volume. Furthermore, these TIDs cannot be compressed: the modified TID may not fit in the space allowed for the original TID. As a result, in many cases, the storage volume of the table data is actually smaller than the storage volume of the TIDs.

SUMMARY

According to one embodiment of the present invention, data from a database object are processed. Transaction information for a set of data of the database object is stored separate from the set of data in an allocated storage space, where the transaction information indicates visibility of the set of data to other transactions. A map structure is generated indicating storage of the set of data and the allocated storage space of the transaction information. The transaction information is altered in response to a transaction to the set of data to alter visibility of the set of data, where altering the transaction information includes: providing updated transaction information within a new storage space in accordance with the transaction to the set of data; and generating a descriptor for the transaction indicating an existing location of the set of data and the new storage space. The map structure may be updated to include the generated descriptor or a pointer thereto.

Embodiments of the present invention include a method, system and computer program product for deleting tuples in a database using a separate transaction identifier storage scheme in substantially the same manner described above.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

Generally, like reference numerals in the various figures are utilized to designate like components.

FIG. 1 is a diagrammatic illustration of an example computing environment for use with an embodiment of the present invention.

FIG. 2 is a graphical illustration of a zone index data structure and data in several stages of transition when managing tuples in a database according to an embodiment of the present invention.

FIG. 3 is a procedural flow chart illustrating a manner in which tuples are added, modified or deleted in a database according to an embodiment of the present invention.

FIG. 4 is a procedural flow chart illustrating a manner in which tuples are deleted in a database according to an embodiment of the present invention.

FIG. 5 is a procedural flow chart illustrating a manner in which tuples are added in a database according to an embodiment of the present invention.

FIG. 6 is a procedural flow chart illustrating a manner in which added, modified or deleted tuples in a database are processed during a database commit according to an embodiment of the present invention.

DETAILED DESCRIPTION

Present invention embodiments improve optimization of a search engine (e.g., a database search engine) operation by storing transaction metadata separately from the data and/or other metadata. In one example, the transaction metadata includes transaction identifiers (TIDs). The TIDs may be based on an integer counter that increments monotonically (e.g., by one) for each new transaction or database scan, thereby creating a unique ID for each transaction. Briefly, the TIDs may be assigned as creator TIDs (ctids) that are unique for a given record or tuple that is newly created by the transaction, or as deleter TIDs (dtids) that are unique for a given record or tuple that is to be deleted (or changed) by the transaction. The ctids and dtids are stored in a column store with one or more TIDs (creator or deleter) being associated with a given tuple. This technique allows several versions of a tuple to exist, where different TIDs may be associated with the versions of a given tuple.

Plural tuples may be grouped together to form a database zone. The zone may comprise sections or segments of a given table, or may be formed of data partitions of convenient size for data processing. Zone indices are maintained along with or that include zone maps that may, in turn, include other indices or descriptors such that a descriptor entry describes the storage for a set of tuples (i.e., the zone index provides a map structure that includes indices, descriptor or other data pointers). A zone index may include one descriptor entry with one version of the dtid column for a set of tuples, and may include another descriptor entry that describes the storage for the same set of tuples, yet with a different version of the dtid column. The zone indices are implemented such that a given transaction can determine which of the versions of the dtid column it should use when processing the set of tuples. Zone indices are further described below.

For example, metadata may be maintained about each region of table storage. The metadata may contain value ranges or range maps that indicate minimum (min) and maximum (max) values for data of a given column (col) (e.g., the min/max values among individual column values stored in a database cell). A zone map may contain multiple range maps.

For example, if a storage region is known to contain records with column values between 100 and 200 (i.e., col 1 {100, 200}), then a query restricted to records with column values greater than 500 will not read that storage region. In contrast, an index provides a pointer to a record (e.g., column value) with a specific value. When the column values associated with a given index are sorted, then an index may provide a starting or stopping point for a search. When range maps are employed, record addition and deletion may not require a change in the range map as long as those record's column values fall within the range map. The zone map may include both indices and range maps, as described hereinafter.

The techniques of present invention embodiments provide multiple advantages. For example, when rows are deleted, the only data written is a new version of the dtid column. Since a change to the dtid column creates an entire new version of the dtid column that is stored in new storage area, the dtid columns can be compressed. If many entries are affected by a deleting transaction, any new versions of the dtid columns may be buffered and processed out sequentially, thereby further minimizing any I/O costs. Multiple entries for the same tuple set can coexist with visibility of the tuple for processing being controlled by the zone index. For example, the zone index comprises information such that a given transaction “sees” those tuples that are appropriate for that transaction. The visibility control information allows database scanners (e.g., accessing and/or retrieving database data) to operate in parallel with a deleting transaction and without synchronizing access to the data. In addition, there is no vulnerability to “torn” or corrupted page data during a read-modify-write sequence, because the delete operation creates a new version of the dtid in storage. In this regard, a database scanner “scans” data (e.g., zone metadata) to determine which segments or portions (e.g., zones) of the data are affected by one or more transactions (i.e., plural transactions may be aggregated or combined, when it may be more efficient).

In one example, the database scanner (e.g., a transaction processing module) may operate to access or retrieve data as follows. The scanner locks the zone index with a shared lock, thereby allowing other scanners to operate in parallel (i.e., concurrently). The scanner creates a list of all zones (e.g., by zone identifier) that it intends to scan. The scanner does not include any zones marked as deleted (e.g., garbage zones). The scanner allocates a scan version number to the scan by incrementing the scan version number associated with a given zone index, and adds that scan version number to the list of active scanners. When the scan completes, the scanner removes the scan version number from the active scanner list and computes the current oldest active scan version number. If there are lists of entries (e.g., tuples) to be deleted that have version numbers less than the oldest scan version number, then the scanner removes those entries.

An example environment for use with present invention embodiments is illustrated in FIG. 1. Specifically, the environment includes one or more server or host systems 10, and one or more data servers 14. Host systems 10 and data servers 14 may be remote from each other and communicate over a network 12. The network may be implemented by any number of any suitable communications media (e.g., wide area network (WAN), local area network (LAN), Internet, intranet, etc.). Alternatively, host systems 10 and data servers 14 may be local to each other, and communicate via any appropriate local communication medium (e.g., local area network (LAN), data center network, hardwire, wireless link, intranet, etc.). One or more clients or end user systems 30 may be coupled to host systems 10 via a network 40, or by a data center network or data center edge switch.

Host systems 10, data servers 14, and clients 30 may be implemented by any conventional or other computer systems preferably equipped with a display or monitor (not shown), a base (e.g., including at least one processor 15, one or more memories 35 and/or internal or external network interfaces or communications devices 25 (e.g., modem, network cards, etc.), optional input devices (e.g., a keyboard, mouse or other input device), and any commercially available and custom software (e.g., server/communications software, mapping module, transaction module, browser/interface software, etc.). Data servers 14 may comprise compute and storage nodes or database engine blades (e.g., in a datacenter or server farm).

Data servers 14 may receive user/DBMS query or transaction information related to desired database information (e.g., data, documents, etc.) from host systems 10. In another example, the transaction information and queries may be received by the data servers, either directly or indirectly (e.g., from a client system). The host systems 10 may include a mapping module 16 to generate zone indices and/or zone maps for a column store (e.g., data range maps, ctids and dtids). In general, ctids are unique identifiers assigned to a tuple upon tuple creation, while dtids are unique identifiers assigned to a tuple upon tuple deletion, modification or replacement. The host systems 10 may also include a transaction module 20 to process transactions configured to add, modify or delete tuples using the zone indices and/or maps.

One or more components of the host systems 10, network 12 and data servers 14 may comprise a database management system (DBMS) or database 18. The database system 18 may use any conventional or other database, or storage unit. Other DBMS components may be local to or remote from host systems 10 and data servers 14, and may communicate via any appropriate communication medium such as network 12 and/or network 40 (e.g., local area network (LAN), wide area network (WAN), Internet, hardwire, wireless link, intranet, etc.). Any clients, hosts, or data servers may present a graphical user interface (e.g., GUI, etc.) or other interface (e.g., command line prompts, menu screens, etc.) to solicit information from users pertaining to zone indices and maps, and transactions, and to provide results (e.g., transaction results, storage statistics, garbage collection statistics, etc.). Further, these systems may provide reports to the user via the display or a printer, or may send the results or reports to another device/system for presenting to the user.

Alternatively, one or more hosts 10 or clients 30 may generate zone indices and/or maps and perform query processing when operating as a stand-alone unit (i.e., without using data servers 14). In a stand-alone mode of operation, the host/client stores or has access to the data (e.g., zone indices and/or maps, databases, etc.), and includes mapping module 16 to generate zone indices and/or maps and transaction module 20 to process transactions. The graphical user interface (e.g., GUI, etc.) or other interface (e.g., command line prompts, menu screens, etc.) solicits information from a corresponding user pertaining to transactions, and may provide reports (e.g., transaction results, storage statistics, garbage collection statistics, etc.).

Mapping module 16 and transaction module 20 may include one or more modules or units to perform the various functions of present invention embodiments described below. The various modules (e.g., mapping module, transaction module, etc.) may be implemented by any combination of any quantity of software and/or hardware modules or units, and may reside within memory 35 of the host and/or data servers for execution by processor 15. It should be understood, that the computing environment depicted in FIG. 1 provides example platforms (e.g., host systems 10, backend or data servers 14) for illustrating the techniques described herein. In this regard, data and zone indices and/or maps on one data server 14 may have no relationship with data, and indices and/or zone maps on another data server 14.

To facilitate the understanding of the inventive concepts presented herein, a series of graphical illustrations, each representing an example data structure for zone indices and their associated data, are described with respect to FIG. 2. In general, present invention embodiments relate to zone indices and zone maps, commit transaction processing, and the operation of database scanners for executing database transactions. Associated with the zone index is a set of data structures that may include: a read-write lock (e.g., in a pthread implementation) for controlling concurrent access to those data structures such as descriptors, a monotonically increasing scan version number, a list of the version numbers of active scanners, and a list, ordered by scan version number, of entries (e.g., zones) in the index that are waiting to be processed (e.g., deleted). In general, the techniques described herein are made with respect to an iteration of a database scan or transaction.

As described above, the table data may be divided into zones each comprising some number of tuples. Each zone has a unique identifier, i.e., a zone identifier (ID). The zone ID is used to map, via the zone index, to a zone descriptor for that zone. In this example, three zone data structures 21, 22 and 23 are depicted in accordance with the passage of time, e.g., during processing of a transaction or scan.

A first data structure 21 is a starting point and comprises a given zone ID 200. The zone ID 200 is, in turn, associated with a zone index 210, where the zone index 210 has a pointer to a zone descriptor 220 (e.g., with an example value of 37). Zone descriptor 220, in turn, comprises data pointers 222, 224, 226 and 228 (e.g., metadata associated with the zone) with each data pointer pointing to columns of data 232, 234, 236 and 238 within the zone. Accordingly, the zone map includes the zone index and the zone descriptor, and the data structure 21 further includes the underlying or associated data. In this example, zone descriptor 220 has a dtid pointer 222, a ctid pointer 224, and pointers 226, 228 to data stored for columns A and B, respectively. The data for the dtid, the ctid, column A and column B may be stored separately from zone descriptor 220. In this example, data structure 21 shows a zone map and data for one zone of a table containing tuples with identifiers ranging from 2000 through 2999.

At some point in time, a delete request is received or generated by the DBMS or record management system. The request may include a “delete tuple” request that includes a tuple identifier value, e.g., “2120”, in order to delete tuple 2120 within the tuple identifier range of 2000 through 2999. In a database that employs MVCC or other versioning scheme, multiple copies of the same or similar record (with their corresponding changes) are stored until all changes are reconciled and committed. Accordingly, multiple unreconciled copies (versions) of a tuple may exist, each with a dtid that corresponds to a time of the change (e.g., either by a timestamp or driven by the sequential incrementing of TIDs that inherently provide a time sequence).

Referring to data structure 22, in order to process the deletion of tuple 2120, a copy of the dtid column 232 is copied (or instantiated) as denoted as dtid′ (prime) 242. The dtid′ column is modified to indicate that tuple 2120 is to be deleted. For example, the current TID is inserted into the dtid′ column for tuple 2120 (e.g., to replace a NULL value or other deleter TID). In addition, tuple 2120 may be explicitly marked for deletion in the column store metadata. Simultaneously, or nearly so, with the creation of dtid′ 242, a new zone descriptor 240 is created with an example value 42. The new zone descriptor 240 substitutes the pointer 222 to the dtid column store with a pointer 252 to the dtid′ column store as shown in the figure.

Upon a successful “commit,” some or all or the pending actions (e.g., tuple additions, modifications or deletions) for the zone are finalized. Referring to data structure 23, after a successful commit, the zone descriptor 220 and the dtid column store 232 are discarded or otherwise marked for deletion as indicted by the arrowed “X” in the figure, the zone index is updated to point to zone descriptor 240, and the new zone descriptor 240 refers to dtid′ 242 via pointer 252. In this regard, the metadata such as zone indices and zone descriptors may be stored in volatile memory while dtid columns, ctid columns, and column stores A and B may be stored in persistent storage. In addition, certain information may be held in a log file to facilitate database reconstruction should a system failure or rollback occur. In this manner, the zone index can use the various versions of the TIDs in the dtid columns to control the “visibility” of a given tuple to a given transaction. The concept of tuple visibility is described with respect to the remaining figures.

A manner in which mapping module 16 and transaction module 20 (e.g., via a host system 10, client systems 30 and/or data server 14) process data within a database object according to an embodiment of the present invention is illustrated in FIG. 3. Initially, given at step 310, a relational database comprises a plurality of tuples in a relation, where a first set of tuple create TIDs and a first set of tuple delete TIDs are stored in a column store. Generally, the techniques described herein are made with respect to databases that employ MVCC. However, any database that allows tuple access, without strict record locking mechanisms may employ the techniques described herein. Furthermore, those skilled in the art would realize that these techniques may be implemented in a row store or hybrid store (e.g., a combination or row and column stores) by separately storing certain deleter information in order to achieve the compression and I/O efficiencies, etc., described above.

A transaction request is received that includes instructions to add, delete or modify tuples in a relation (or zone partition or segment) and the transaction request is assigned a current TID at step 320. The tuple sets for the operation (i.e., those tuples impacted by the operation) are identified at step 330. The transactions, as used herein, may be executed by functions, function calls, procedures, remote procedure calls (RPCs), and the like (e.g., by mapping module 16 and transaction module 20). For add transactions, the set of tuples to be added, or the representations thereof, may be referred to as an add-tuple-set. The add tuple transaction may include, e.g., actual tuple data, pointers to the data, or tuple identifiers. For delete transactions, there is a delete-tuple-set provided in the request that identifies tuples to be deleted. In this regard, for a delete transaction, tuples may be marked for deletion. However, for simplicity, with a modify transaction, the tuples to be modified may be both modified and stored anew, while the original tuples are deleted. In that sense, tuple modify transactions comprise both an add-tuple-set to add modified tuples as a new set of tuples and a delete-tuple-set to discard the version of tuples prior to said modification.

Since a delete or modify transaction implies the removal of data, the delete-tuple-set may be identified by querying the relation and applying MVCC filtering (i.e., determining if a tuple is visible to the transaction). It is determined whether a delete-tuple-set is part of the transaction request (e.g., for delete or modify transaction requests) at step 340. When the processing of a transaction request indicates that a delete-tuple-set is present at step 340, the process proceeds to step 360 where the process description continues with respect to FIG. 4. Otherwise the process determines whether an add-tuple-set is present at step 350. When a transaction includes an add-tuple-set, the process proceeds to step 370 where the process description continues with respect to FIG. 5. When transaction processing for a given transaction (or set of transactions) is complete the process ends at step 380.

In the examples presented herein with respect to the various flowcharts, it will be appreciated that DBMS operations are complex, nested or may otherwise comprise entry or exit points for the various enumerated flowchart steps or other process steps that are not specifically described or enumerated herein. Any given step or processing point may include processing options for commit processing that may be initiated at a convenient database processing point, e.g., a commit may be initiated after any given transaction has been processed. Examples of commit processing are described in connection with FIG. 6.

Referring to FIG. 4, the manner in which mapping module 16 and/or transaction module 20 delete tuples within a database object (e.g., a table or relation) continues from FIG. 3 to FIG. 4 as indicated by off-page connector at reference numeral 410. In this example, the delete-tuple-set is generated and comprises a hierarchy that may include a list of zones containing tuples to be deleted, and for each zone, a list of the tuples in that zone to be deleted at step 420. For each zone associated with tuples in the delete-tuple-set, a series of steps are described with respect to each zone to be processed beginning at step 430. The series of steps at 430 may be iteratively processed for each zone, e.g., by way of a processing queue. With respect to each zone to be processed at step 430, first and second zone descriptors, and first and second dtids are referred to with respect to FIG. 4 in order to indicate a temporal relationship between the descriptors and dtids on a per zone processing basis.

A copy of a first zone descriptor is created to produce a second zone descriptor at step 440. Further, a copy of the first zone's dtid column is created to produce a second dtid column at step 445. The copy of the second zone descriptor is modified to describe the second dtid column at step 450. For those tuples to be deleted in the zone, store the current TID in the second dtid column at step 455. Garbage collection statistics are computed (or generated) for the zone during zone processing and the garbage collection statistics are stored in or along with the second zone descriptor at step 460. Once the garbage collection statistics (e.g., additional metadata) are amassed for the given zone, the process at step 430 iterates until processing for each zone of the delete-tuple-set is complete at step 470. The process returns, at step 480, to FIG. 3 at step 350.

Returning to FIG. 3, it is determined whether an add-tuple-set is part of the transaction request (e.g., for add or modify transaction requests) at step 350. When a transaction that includes an add-tuple-set is present, the process proceeds to step 370 where the process description continues with respect to FIG. 5. When the processing of a transaction request indicates that an add-tuple-set is not present, the process ends at step 380.

Referring to FIG. 5, the manner in which mapping module 16 and/or transaction module 20 processes or accesses data within a database object continues from FIG. 3 to FIG. 5 as indicated by off-page connector at reference numeral 510. In this example, the add-tuple-set comprises a list of tuples or their identifiers. The tuples identified in the add-tuple-set are partitioned among their respective zones at step 520. In other words, the tuples in the add-tuple-set may span plural zones whereby the zoned tuple partitions are iteratively processed on a zone-by-zone basis that is similar to the processing of tuples in a delete-tuple-set.

Each set of tuples assigned to a particular zone at step 520 are decomposed into columns for their respective zones at step 530. The decomposing step 530 recognizes that for column stores of the present invention embodiments, column data has a correlation with tuple (row) data. As part of decomposing step 530, for all tuples added, their corresponding ctid values are assigned or set to the current TID value since they are newly being created. Zone descriptors are created for each zone with tuples added thereto, and their corresponding garbage collection statistics for the new tuples may be set to a non-descript value or NULL at step 540 (i.e., no database garbage exists for newly added tuples). When transaction processing for an add-tuple-set transaction (or set of transactions) is complete, the process returns, at step 550, to FIG. 3, step 380 where tuple processing ends.

In one example, once a portion of tuple processing with respect to add-tuple-set and/or delete-tuple-set transactions are complete, a commit procedure may be executed and is described in connection with FIG. 6. As described above, it should be noted that commit processing may be initiated at any particular processing point. The commit procedure ensures that tuples processed by multiple or concurrently run transactions are returned to a stable state (e.g., from a volatile state resulting from multiple transactions applied to a given tuple). For example, a given tuple may have a column variable changed, e.g., a date column is changed by a date change transaction and a dollar column is changed by a price adjustment transaction. By way of these transactions, three tuples may exist. For example, a first tuple may be the original tuple, a second tuple is created by the date change transaction and a third tuple is created by price adjustment transaction. At commit, a fourth tuple may be created or one of the three existing tuples may be used to combine changes to the original tuple embodied in the second and third tuples to generate a final tuple for storage and/or additional processing.

The manner in which mapping module 16 and transaction module 20 commit tuples (data) from one or more transactions within a database object is described with respect to FIG. 6. Initially, given at step 610, a zone is in a volatile state with one or more add, modify or delete operations having been performed. As previously described, the tuples within a zone may be in a volatile state (i.e., with pending to uncommitted transactions) and include added zone descriptors with added columns of data, added zone descriptors and added delete tuple identifier columns (i.e., dtid columns).

A database commit function (e.g., for a current transaction) is executed at step 615. The commit function allows for the reconciliation of plural transaction with respect to the zone (i.e., the transactions are made permanent with respect to a given commit transaction). Commit transaction processing may operate as follows. The zone index is exclusively locked, thereby preventing a scanner from creating a new list of zones. Newly created database entries (e.g., added tuples) may be inserted, e.g., by reference, into the zone index, and for deleted database entries (e.g., deleted tuples), those records may be marked for deletion, where the commit process may not remove the entries from the index. One reason the commit process may not remove the entries is that an active table scan (e.g., from another transaction) may have started before the current commit, and may still need to reference those entries. The committing transaction saves its list of entries to delete and the current scan version number in the zone index structure.

It is determined whether the commit (e.g., for a current transaction) was successful at step 620. Under certain circumstances the database cannot perform a successful commit. Typically, the transaction or plural transactions may contain logical errors or user errors that do not result in a record that can be made permanent by way of a current commit operation. Accordingly, the respective transactions cannot be completed and are placed in failed state (e.g., an SQL abort state). When the commit fails, those affected transactions are rolled back to their pre-transaction state and an error or other notification may be generated.

Accordingly, when the commit fails, as determined at step 620, all secondary zone descriptors and all secondary delete tuple identifier columns (dtids′) for all zones in all delete-tuple-sets are freed at step 630. All added zone descriptors and all added columns of data from all add-tuple-sets are freed at step 640. In general, when the zone descriptors are discarded or freed, it means the storage space held by the data is freed. In the case of a delete transaction, there are two zone descriptors pointing to the same storage spaces for all but the deleter TID column(s). It is not desirable to free that particular storage (since there are multiple references (pointers)) until those references can be affirmatively resolved. One example manner handling this issue is with reference counting. A physical page of storage can be used by one or more columns in one or more zone descriptors (i.e., a page of data may span multiple zones). Each use of the page is counted. Discarding may be accomplished by decrementing the reference or “use” count. When the count goes to zero, it means that the storage can be freed back for allocation. The failed portion of the commit process ends at step 680.

When the commit is successful, as determined at step 620, the zone map is updated by adding all zone descriptors from all add-tuple-sets at step 650. The zone map is further updated by removing all first zone descriptors and replacing them with all second zone descriptors at step 660. All first zone descriptors and first delete tuple identifier columns are freed for all zones in the delete-tuple-set at step 670. The successful portion of the commit process ends at step 680.

At some point in time, the database becomes in need of a clean up (e.g., similar to disk defragmentation). In other words, there may be storage segments in need of consolidation or garbage collection. The DBMS maintains metadata to know whether a given version of a tuple should be visible to a given transaction. In this regard, each user or process that initiates a transaction may be given a snapshot of the tuples affected by the transaction. That version of tuple may be identified by the TID or a timestamp. Accordingly, when a database technique such as MVCC is employed, the various transactions may see different versions of those tuples. Eventually, after plural transactions, some tuple may no longer be visible to any transaction and can be garbage collected.

To further illustrate, each executing transaction has a list of TIDs for other transactions whose effects the current transaction cannot “see” (i.e., concurrent transactions or transactions that have not been committed). That list of TIDs may be referred to as the “invisibility list” or conversely, other TIDs may be considered “visible.” Specifically, the current transaction can test the ctid of a tuple against the invisibility list to learn if the tuple was created by a transaction on the invisibility list (i.e., prior to the current transaction, yet uncommitted) and that the current transaction should not process “invisible” tuples. For example, given the temporal nexus between monotonically incremented TIDs, those transactions with TIDs (e.g., ctids) on the invisibility list have not been committed, and therefore represent an “unknown” transaction state.

Similarly, the current transaction can test the TID (e.g., dtid) of a tuple to learn if the tuple was deleted by a transaction on the invisibility list and that the current transaction should process the tuple on the invisibility list as if it were “visible.” For example, those transactions that delete tuples prior to the execution of the current transaction represent viable tuples for processing and tuples that may be used during the commit process. When tuples are no longer visible based on the invisibility lists, the tuple may be ignored by the current transaction or ultimately may be garbage collected.

It will be appreciated that the embodiments described above and illustrated in the drawings represent only a few of the many ways of implementing techniques to delete tuples in a database using a scheme with separate transaction identifier storage.

The environment of the present invention embodiments may include any number of computer or other processing systems (e.g., client or end-user systems, host systems, data servers, etc.) and databases or other repositories arranged in any desired fashion, where the present invention embodiments may be applied to any desired type of computing environment (e.g., cloud computing, client-server, network computing, mainframe, stand-alone systems, etc.). The computer or other processing systems employed by the present invention embodiments may be implemented by any number of any personal or other type of computer or processing system (e.g., desktop, laptop, PDA, mobile devices, etc.), and may include any commercially available operating system and any combination of commercially available and custom software (e.g., browser software, communications software, server software, mapping module, transaction module, etc.). These systems may include any types of monitors and input devices (e.g., keyboard, mouse, voice recognition, etc.) to enter and/or view information.

It is to be understood that the software (e.g., mapping module, transaction module, etc.) of the present invention embodiments may be implemented in any desired computer language and could be developed by one of ordinary skill in the computer arts based on the functional descriptions contained in the specification and flow charts illustrated in the drawings. Further, any references herein of software performing various functions generally refer to computer systems or processors performing those functions under software control. The computer systems of the present invention embodiments may alternatively be implemented by any type of hardware and/or other processing circuitry.

The various functions of the computer or other processing systems may be distributed in any manner among any number of software and/or hardware modules or units, processing or computer systems and/or circuitry, where the computer or processing systems may be disposed locally or remotely of each other and communicate via any suitable communications medium (e.g., LAN, WAN, intranet, Internet, hardwire, modem connection, wireless, etc.). For example, the functions of the present invention embodiments may be distributed in any manner among the various end-user/client, data servers, and host systems, and/or any other intermediary processing devices. The software and/or algorithms described above and illustrated in the flow charts may be modified in any manner that accomplishes the functions described herein. In addition, the functions in the flow charts or description may be performed in any order that accomplishes a desired operation.

The software of the present invention embodiments (e.g., mapping module, transaction module, etc.) may be available on a non-transitory computer useable medium (e.g., magnetic or optical mediums, magneto-optic mediums, floppy diskettes, CD-ROM, DVD, memory devices, etc.) of a stationary or portable program product apparatus or device for use with stand-alone systems or systems connected by a network or other communications medium.

The communication network may be implemented by any number of any type of communications network (e.g., LAN, WAN, Internet, intranet, VPN, etc.). The computer or other processing systems of the present invention embodiments may include any conventional or other communications devices to communicate over the network via any conventional or other protocols. The computer or other processing systems may utilize any type of connection (e.g., wired, wireless, etc.) for access to the network. Local communication media may be implemented by any suitable communication media (e.g., local area network (LAN), hardwire, wireless link, intranet, etc.).

The system may employ any number of any conventional or other databases, data stores or storage structures (e.g., files, databases, data structures, data or other repositories, etc.) to store information (e.g., data, documents, zone indices/maps, etc.). The database system may be implemented by any number of any conventional or other databases, data stores or storage structures (e.g., files, databases, data structures or tables, data or other repositories, etc.) to store information (e.g., data, documents, zone indices/maps, etc.). The database system may be included within or coupled to the server and/or client systems. The database systems and/or storage structures may be remote from or local to the computer or other processing systems, and may store any desired data (e.g., data, documents, zone indices/maps, etc.).

The present invention embodiments may employ any number of any type of user interface (e.g., Graphical User Interface (GUI), command-line, prompt, etc.) for obtaining or providing information (e.g., databases, documents, indices, range maps, transaction information, etc.), where the interface may include any information arranged in any fashion. The interface may include any number of any types of input or actuation mechanisms (e.g., buttons, icons, fields, boxes, links, etc.) disposed at any locations to enter/display information and initiate desired actions via any suitable input devices (e.g., mouse, keyboard, etc.). The interface screens may include any suitable actuators (e.g., links, tabs, etc.) to navigate between the screens in any fashion.

The present invention embodiments are not limited to the specific tasks or algorithms described above, but may be utilized for generating zone indices or zone maps associated with any type of database, memory or any other storage structure (e.g., data, zone indices, zone maps, descriptors, ctids, dtids, etc.).

The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises”, “comprising”, “includes”, “including”, “has”, “have”, “having”, “with” and the like, when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.

The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of the present invention has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the invention. The embodiment was chosen and described in order to best explain the principles of the invention and the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated.

The descriptions of the various embodiments of the present invention have been presented for purposes of illustration, but are not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein was chosen to best explain the principles of the embodiments, the practical application or technical improvement over technologies found in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.

The present invention may be a system, a method, and/or a computer program product. The computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present invention.

The computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.

Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.

Computer readable program instructions for carrying out operations of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++ or the like, and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions.

These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.

The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.

The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions. 

1-7. (canceled)
 8. A method comprising: partitioning, via a hardware processor, a database to store a database object in a form of a database table as a plurality of different zones; scanning, via the hardware processor, a set of data located within a zone to identify one or more transactions to delete one or more data tuples located within the zone; storing, via the hardware processor, transaction identifiers associated with the one or more identified transactions in an allocated storage space separate from the set of data located within the zone, wherein the transaction identifiers are associated with the one or more data tuples deleted by the one or more identified transactions; generating, via the hardware processor, a map structure indicating storage of the set of data located within the zone and the allocated storage space of the transaction identifiers associated with each of the one or more identified transactions, wherein the map structure includes a first zone descriptor indicating the allocated storage space of the transaction identifiers; updating, via the hardware processor, the transaction identifiers in response to receiving a current transaction to delete one or more data tuples located within the zone, wherein updating the transaction identifiers includes: generating one or more transaction identifiers associated with the one or more data tuples deleted by the current transaction and storing the one or more transaction identifiers associated with the current transaction within a new storage space such that the one or more transaction identifiers associated with the current transaction is stored separately from the allocated storage space of the transaction identifiers of the one or more identified transactions; generating, via the hardware processor, a second zone descriptor associated with the zone within the map structure indicating for the set of data located within the zone the new storage space for the updated transaction identifiers in place of the allocated storage space; and replacing, via the hardware processor, the first zone descriptor with the generated second zone descriptor associated with the zone within the map structure.
 9. The method of claim 8, wherein updating the transaction identifiers renders portions of the set of data created by concurrently executing transactions invisible to the one or more identified transactions and renders portions of the set of data deleted by concurrently executing transactions visible to the one or more identified transactions based on transaction identifiers for the concurrently executing transactions.
 10. The method of claim 8, wherein replacing the first zone descriptor includes: replacing the first zone descriptor with the generated second zone descriptor within the map structure in response to the current transaction being committed.
 11. The method of claim 8, further comprising: rolling back the transaction to the set of data by discarding the second zone descriptor and deallocating the new storage space for the updated transaction identifiers.
 12. The method of claim 8, further comprising: storing the updated transaction identifiers in a contiguous storage space and compressing the updated transaction identifiers.
 13. The method of claim 8, wherein: when one or more transactions creates one or more data tuples located within the zone, the transaction identifier is assigned as a creator identifier; and when one or more transactions modifies one or more data tuples located within the zone, the transaction identifier is assigned as a deleter identifier.
 14. The method of claim 8, wherein each of the plurality of different zones includes metadata describing the one or more data tuples located within the zone.
 15. A system comprising: at least one computer processor configured to: partition a database to store a database object in a form of a database table as a plurality of different zones; scan a set of data located within a zone to identify one or more transactions to delete one or more data tuples located within the zone; store transaction identifiers associated with the one or more identified transactions in an allocated storage space separate from the set of data located within the zone, wherein the transaction identifiers are associated with the one or more data tuples deleted by the one or more identified transactions; generate a map structure indicating storage of the set of data located within the zone and the allocated storage space of the transaction identifiers associated with each of the one or more identified transactions, wherein the map structure includes a first zone descriptor indicating the allocated storage space of the transaction identifiers; update the transaction identifiers in response to receiving a current transaction to delete one or more data tuples located within the zone, wherein updating the transaction identifiers includes: generating one or more transaction identifiers associated with the one or more data tuples deleted by the current transaction and storing the one or more transaction identifiers associated with the current transaction within a new storage space such that the one or more transaction identifiers associated with the current transaction is stored separately from the allocated storage space of the transaction identifiers of the one or more identified transactions; generate a second zone descriptor associated with the zone within the map structure indicating for the set of data located within the zone the new storage space for the updated transaction identifiers in place of the allocated storage space; and replace the first zone descriptor with the generated second zone descriptor associated with the zone within the map structure.
 16. The system of claim 15, wherein updating the transaction identifiers renders portions of the set of data created by concurrently executing transactions invisible to the one or more identified transactions and renders portions of the set of data deleted by concurrently executing transactions visible to the one or more identified transactions based on transaction identifiers for the concurrently executing transactions.
 17. The system of claim 15, wherein the first zone descriptor is replaced with the generated second zone descriptor within the map structure in response to the current transaction being committed.
 18. The system of claim 15, wherein the at least one computer processor is further configured to: roll back the transaction to the set of data by discarding the second zone descriptor and deallocating the new storage space for the updated transaction identifiers.
 19. The system of claim 15, wherein the at least one computer processor is further configured to: store the updated transaction identifiers in a contiguous storage space and compress the updated transaction identifiers.
 20. A computer program product comprising: a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising computer readable program code configured to: partition a database to store a database object in a form of a database table as a plurality of different zones; scan a set of data located within a zone to identify one or more transactions to delete one or more data tuples located within the zone; store transaction identifiers associated with the one or more identified transactions in an allocated storage space separate from the set of data located within the zone, wherein the transaction identifiers are associated with the one or more data tuples deleted by the one or more identified transactions; generate a map structure indicating storage of the set of data located within the zone and the allocated storage space of the transaction identifiers associated with each of the one or more identified transactions, wherein the map structure includes a first zone descriptor indicating the allocated storage space of the transaction identifiers; update the transaction identifiers in response to receiving a current transaction to delete one or more data tuples located within the zone, wherein updating the transaction identifiers includes: generating one or more transaction identifiers associated with the one or more data tuples deleted by the current transaction and storing the one or more transaction identifiers associated with the current transaction within a new storage space such that the one or more transaction identifiers associated with the current transaction is stored separately from the allocated storage space of the transaction identifiers of the one or more identified transactions; generate a second zone descriptor associated with the zone within the map structure indicating for the set of data located within the zone the new storage space for the updated transaction identifiers in place of the allocated storage space; and replace the first zone descriptor with the generated second zone descriptor associated with the zone within the map structure.
 21. The computer program product of claim 20, wherein updating the transaction identifiers renders portions of the set of data created by concurrently executing transactions invisible to the one or more identified transactions and renders portions of the set of data deleted by concurrently executing transactions visible to the one or more identified transactions based on transaction identifiers for the concurrently executing transactions.
 22. The computer program product of claim 20, wherein the first zone descriptor is replaced with the generated second zone descriptor within the map structure in response to the current transaction being committed.
 23. The computer program product of claim 20, wherein the computer readable program code further comprises computer readable program code configured to: roll back the transaction to the set of data by discarding the second zone descriptor and deallocating the new storage space for the updated transaction identifiers.
 24. The computer program product of claim 20, wherein the computer readable program code further comprises computer readable program code configured to: store the updated transaction identifiers in a contiguous storage space and compress the updated transaction identifiers.
 25. The system of claim 15, wherein: when one or more transactions creates one or more data tuples located within the zone, the transaction identifier is assigned as a creator identifier; and when one or more transactions modifies one or more data tuples located within the zone, the transaction identifier is assigned as a deleter identifier.
 26. The computer program product of claim 20, wherein: when one or more transactions creates one or more data tuples located within the zone, the transaction identifier is assigned as a creator identifier; and when one or more transactions modifies one or more data tuples located within the zone, the transaction identifier is assigned as a deleter identifier.
 27. The computer program product of claim 20, wherein each of the plurality of different zones includes metadata describing the one or more data tuples located within the zone. 